Massive Parallelism with Workstation Clusters {
نویسنده
چکیده
Workstation cluster computing recently has become an important and successful technique. The communication bottleneck limits this approach to small and medium sized conngurations of up to 30 workstations for most applications. This paper demonstrates that for certain algorithms massively parallel cluster computing using thousands of workstations in the Internet is feasible. It describes structures for the coordination of a large number of geographically dispersed processes. The paper introduces Lola, a library supporting massively parallel computing in wide area networks, and provides an application example.
منابع مشابه
Massive Parallelism with Workstation Clusters: Challenge or Nonsense?
Workstation cluster computing recently has become an important and successful technique. The communication bottleneck limits this approach to small and medium sized conngurations of up to 30 workstations for most applications. This paper demonstrates that for certain algorithms massively parallel cluster computing using thousands of workstations in the Internet is feasible. It describes structu...
متن کاملConcurrent and Distributed Data Structures for Multikey Sorting on Computer Clusters
Parallel computing has long offered the promise of very high performance for a wide range of applications, but unfortunately it is hampered by several drawbacks. Among the drawbacks of exploiting parallelism is the cost of messagepassing and communication overhead. Consequently, the trend in parallel and distributed computations is moving away from specialized platforms, such as the Cray/SGI T3...
متن کاملToward Massive Dual-Level Parallelism in Cluster Computing
The increasing speed of network technology for workstation clusters has allowed a larger number of independent machines to cooperate in a computation. The recent availability of multiprocessor workstations provides an opportunity to increase the number of participating processors even further. The dual-level parallelism ooered by this platforms allows the simultaneous use of distributed and sha...
متن کاملParallel Algorithm for Filamentation of High-Power Super-Short Laser Pulses
An efficient parallel algorithm is proposed for solving the filamentaion problem of high-power femtosecond lasers pulses in gases. It was demonstrated that the algorithm possesses the property of coarse-grained parallelism and has a good scale-up characteristics when used on workstation clusters.
متن کاملIterative Solution of General Sparse Linear Systems on Clusters of Workstations
Solving sparse irregularly structured linear systems on parallel platforms poses several challenges. First, sparsity makes it diicult to exploit data locality and this is true for both distributed and shared memory environments. Second, it is diicult to nd eecient ways to precondition the system. For example, preconditioning techniques that have a high degree of parallelism often lead to slower...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1993